An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
نویسندگان
چکیده
It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This improves upon the previously best-known bound of O(log k) and is existentially tight, up to a constant factor. An algorithm for finding a cut with ratio within a factor of O(log k) of the maximum concurrent flow, and thus of the optimal min-cut ratio, is presented.
منابع مشابه
Approximate Max-Flow Min-Cut Theorems (Course Notes Extension for COMP5703)
In this report, we discuss two approximate max-flow min-cut theorems that first introduced by Tom Leighton and Satish Rao in 1988 [9] and extended in 1999 [10] for uniform multicommodity flow problems. In the theorems they first showed that for any n-node multicommodity flow problem with uniform demands, the max-flow is a Ω(log n) factor smaller than the min-cut; further,they proved the max-flo...
متن کامل8.1 Balanced Cut
In the last lecture, we described an O(log k logD)-approximation algorithm for Sparsest Cut, where k is the number of terminal pairs and D is the total requirement. Today we will describe an application of Sparsest Cut to the Balanced Cut problem. We will then develop an O(log k)approximation algorithm for Sparsest Cut, due to Linial, London, and Rabinovich [4], using metric embeddings techniqu...
متن کاملApproximate Max--ow Min-(multi)cut Theorems and Their Applications
Consider the multicommodity ow problem in which the object is to maximize the sum of commodities routed. We prove the following approximate max-ow min-multicut theorem: min multicut O(log k) max ow min multicut; where k is the number of commodities. Our proof is constructive; it enables us to nd a multicut within O(log k) of the max ow (and hence also the optimal multicut). In addition, the pro...
متن کاملAn Approximate Max-Flow Min-Cut Relation for Unidirected Multicommodity Flow, with Applications
In this paper , we prove the first approximate max-flow min-cut theorem for undirected mul t i commodi ty flow. We show tha t for a feasible flow to exist in a mul t icommodi ty problem, it is sufficient t ha t every cut ' s capacity exceeds its demand by a factor of O(logClogD), where C is the sum of all finite capacities and D is the sum of demands . Moreover, our theorem yields an a lgor i t...
متن کاملLecture 24 : Hardness of approximation of MAX - CUT April 10 , 2008
• The 1 vs 1 decision problem is easy for MAX-CUTas the problem is equivalent to testing if the graph is bipartite. • Goemans-Williamson's SDP based algorithm for MAX-CUTyields a 1 2 (1−ρ) vs (arccos(ρ))/π approximation for all ρ < −0.69. Replacing ρ with 2δ − 1 shows that the 1 − δ vs 1 − Θ(√ δ) problem is easy. If we think about MAX-CUTas MIN-UNCUT, this would mean that the δ vs Θ(√ δ) proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Comput.
دوره 27 شماره
صفحات -
تاریخ انتشار 1998